An embedding theorem for free inverse semigroups
نویسندگان
چکیده
منابع مشابه
Anisimov's Theorem for inverse semigroups
The idempotent problem of a finitely generated inverse semi-group is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent problem is necessarily finite. This answers a question of Gilbert and Noonan Heale, and establishes a gen-eralisation to inverse semigroups of Anisimov's Th...
متن کاملOn Some Embedding Theorems for Inverse Semigroups
A semilattice decomposition of an inverse semigroup has good internal mapping properties. These are used to give natural proofs of some embedding theorems, which were originally proved in a rather artificial way. The reader is referred to [1] for the basic theory of inverse semigroups. In an earlier paper [3] we proved the following embedding result: (1) An E-unitary inverse semigroup is isomor...
متن کاملAmalgams of Free Inverse Semigroups
We study inverse semigroup amalgams of the form S U T where S and T are free inverse semigroups and U is an arbitrary nitely generated inverse subsemigroup of S and T. We make use of recent work of Bennett to show that the word problem is decidable for any such amalgam. This is in contrast to the general situation for semigroup amalgams, where recent work of Birget, Margolis and Meakin shows th...
متن کاملGrÖbner-shirshov Bases for Free Inverse Semigroups
A new construction for free inverse semigroups was obtained by Poliakova and Schein in 2005. Based on their result, we find Gröbner-Shirshov bases for free inverse semigroups with respect to the deg-lex order of words. In particular, we give the (unique and shortest) normal forms in the classes of equivalent words of a free inverse semigroup together with the Gröbner-Shirshov algorithm to trans...
متن کاملEmbedding theorems for HNN extensions of inverse semigroups
We discuss embedding theorems for HNN extensions and clarify the relationship between the concept by Gilbert and that of Yamamura. We employ the automata theoretical technique based on the combinatorial and geometrical properties of Schützenberger graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 1981
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089500004687